Definitions of intent suitable for algorithms
نویسندگان
چکیده
Abstract This article introduces definitions for direct, means-end, oblique (or indirect) and ulterior intent which can be used to test in an algorithmic actor. These of are informed by legal theory from common law jurisdictions. Certain crimes exist where the harm caused is dependent on reason it was done so. Here actus reus or performative element crime mental state mens rea The ability prosecute these identify diagnose intentional states accused. A certain class auto didactic actor given broad objectives without being told how meet them. Without a definition intent, they cannot not engage breaking behaviour nor ever identified as having it. ambiguity neither positive owner algorithm society. problem exists over above more familiar debates concerning eligibility algorithms culpability judgements that usually associated with. Aside inchoate offences, many economic with elements fraud deceit fall into this category crime. Algorithms operate areas could plausibly undertaken depending whether existed not.
منابع مشابه
Color Reproduction Algorithms and Intent
The effect of image type on systematic differences from strict colorimetric reproduction is investigated and discussed. Different situations, called “color intents,” are described. We have identified four basic color intents. Color reproduction algorithms for each intent are presented, together with guidelines for selecting the appropriate intent. Cite This Paper: J A Stephen Viggiano and Natha...
متن کاملTwo Algorithms Suitable for Constructive Utility Planning
We discuss two algorithms suitable for constructive utility planning using both actions and observations, which are based on iterative plan modification instead of n-step plan generation. We have analysed runtime costs and solution quality both theoretically and on a set of examples. For most situations we analysed, our algorithms perform better than conventional plan generation algorithms usin...
متن کاملAlgorithms: A Quest for Absolute Definitions
What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turing thesis and contrast Church’s and Turing’s approaches, and we finish with some recent investigations.
متن کاملDefinitions and Algorithms in SEGID
Given a (multiple) sequence alignment, SEGID first converts it into a sequence of numbers, where each number is the alignment score of a column. (SEGID also directly accepts a sequence of numbers as input.) Then it provides three algorithms to identify conserved segments (high score substrings): 1. Longest segment (with average value lower bound): given a string of numbers and a number A, find ...
متن کاملSimple Examples of Sublinear-time Algorithms for Graphs 1.1 Definitions
For sublinear-time algorithms, it is crucial how input is represented and accessed. Depending on input representation and queries allowed, we might or might not be able to solve a given problem in sublinear time. In addition, in the property testing model, the correctness guarantee of the algorithm depends on the distance between objects, which is typically normalized by the size of the input. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence and Law
سال: 2022
ISSN: ['0924-8463', '1572-8382']
DOI: https://doi.org/10.1007/s10506-022-09322-x